Software Effort Estimation Using Logarithmic Fuzzy Preference Programming and Least Squares Support Vector Machines

نویسندگان

چکیده

Purpose: Effort Estimation is a process by which one can predict the development time and cost to develop software or product. Many approaches have been tried this probabilistic accurately, but no single technique has consistently successful. There many studies on effort estimation using Fuzzy Machine Learning. For reason, study aims combine Learning get better results.Methods: Various methods combinations carried out in previous research, research tries methods, namely Logarithmic Preference Programming (LFPP) Least Squares Support Vector Machines (LSSVM). LFPP used recalculate driver weights generate Adjustment Point (EAP). The EAP Lines of Code values are then entered as input for LSSVM. output results measured Mean Magnitude Relative Error (MMRE) Root-Mean-Square (RMSE). In study, COCOMO NASA datasets were used.Result: obtained MMRE 0.015019 RMSE 1.703092 dataset, while dataset 0.007324 6.037986. Then 100% prediction meet 1% range actual show that 89,475 5% effort. also level accuracy than Intermediate method.Novelty: This uses combination LSSVM, an improvement from FAHP method different where produces all data training testing, whereas it only small part data.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Least Squares Twin Support Vector Machines

Least Squares Twin Support Vector Machine (LSTSVM) is an extremely efficient and fast version of SVM algorithm for binary classification. LSTSVM combines the idea of Least Squares SVM and Twin SVM in which two nonparallel hyperplanes are found by solving two systems of linear equations. Although, the algorithm is very fast and efficient in many classification tasks, it is unable to cope with tw...

متن کامل

Using Least Squares Support Vector Machines for Frequency Estimation

Frequency estimation is transformed to a pattern recognition problem, and a least squares support vector machine (LS-SVM) estimator is derived. The estimator can work efficiently without the need of statistics knowledge of the observations, and the estimation performance is insensitive to the carrier phase. Simulation results are presented showing that proposed estimators offer better performan...

متن کامل

Least Squares Support Vector Machines and Primal Space Estimation

In this paper a methodology for estimation in kernel-induced feature spaces is presented, making a link between the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM) and classical statistical inference techniques in order to perform linear regression in primal space. This is done by computing a finite dimensional approximation of the kernel-induced feature space mapping ...

متن کامل

Fuzzy least squares support vector machines for multiclass problems

In least squares support vector machines (LS-SVMs), the optimal separating hyperplane is obtained by solving a set of linear equations instead of solving a quadratic programming problem. But since SVMs and LS-SVMs are formulated for two-class problems, unclassifiable regions exist when they are extended to multiclass problems. In this paper, we discuss fuzzy LS-SVMs that resolve unclassifiable ...

متن کامل

Least Squares Support Vector Machines: an Overview

Support Vector Machines is a powerful methodology for solving problems in nonlinear classification, function estimation and density estimation which has also led recently to many new developments in kernel based learning in general. In these methods one solves convex optimization problems, typically quadratic programs. We focus on Least Squares Support Vector Machines which are reformulations t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Journal of Informatics

سال: 2022

ISSN: ['2407-7658', '2460-0040']

DOI: https://doi.org/10.15294/sji.v10i1.39865